Commutative semigroups whose lattice of tolerances is Boolean
نویسندگان
چکیده
منابع مشابه
Characterization and axiomatization of all semigroups whose square is group
In this paper we give a characterization for all semigroups whose square is a group. Moreover, we axiomatize such semigroups and study some relations between the class of these semigroups and Grouplikes,introduced by the author. Also, we observe that this paper characterizes and axiomatizes a class of Homogroups (semigroups containing an ideal subgroup). Finally, several equivalent conditions ...
متن کاملDefinability in the Lattice of Equational Theories of Commutative Semigroups
In this paper we study first-order definability in the lattice of equational theories of commutative semigroups. In a series of papers, J. Ježek, solving problems posed by A. Tarski and R. McKenzie, has proved, in particular, that each equational theory is first-order definable in the lattice of equational theories of a given type, up to automorphism, and that such lattices have no automorphism...
متن کاملcharacterization and axiomatization of all semigroups whose square is group
in this paper we give a characterization for all semigroups whose square is a group. moreover, we axiomatize such semigroups and study some relations between the class of these semigroups and grouplikes,introduced by the author. also, we observe that this paper characterizes and axiomatizes a class of homogroups (semigroups containing an ideal subgroup). finally, several equivalent conditions ...
متن کاملVarieties of Commutative Semigroups
In this paper, we describe all equational theories of commutative semigroups in terms of certain well-quasi-orderings on the set of finite sequences of nonnegative integers. This description yields many old and new results on varieties of commutative semigroups. In particular, we obtain also a description of the lattice of varieties of commutative semigroups, and we give an explicit uniform sol...
متن کاملTotally Ordered Commutative Semigroups
Let 5( + , < ) be a system consisting of a set S endowed with an associative binary operation + and a total ( = linear = simple) order relation < . The composition + and the relation < may be connected by either or both of the following conditions. MC (Monotone Condition). If a and b are elements of 5 such that ax+y ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1988
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1988.102216